Modular graphs
نویسندگان
چکیده
منابع مشابه
modular edge colorings of mycielskian graphs
let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$ ($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same. the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...
متن کاملMaximum modular graphs
Modularity has been explored as an important quantitative metric for community and cluster detection in networks. Finding the maximum modularity of a given graph has been proven to be NPcomplete and therefore, several heuristic algorithms have been proposed. We investigate the problem of finding the maximum modularity of classes of graphs that have the same number of links and/or nodes and dete...
متن کاملModular Representations of Graphs
A graph G has a representation modulo r if there exists an injective map f : V (G) → {0, 1, ..., r − 1} such that vertices u and v are adjacent if and only if f(u) − f(v) is relatively prime to r. The representation number of G, rep(G), is the smallest integer such that G has a representation modulo r. In this paper we study the representation numbers of various graphs, such as the complete ter...
متن کاملCoset Graphs and Modular Surfaces
We establish a correspondence between generalized quiver gauge theories in four dimensions and congruence subgroups of the modular group, hinging upon the trivalent graphs which arise in both. The gauge theories and the graphs are enumerated and their numbers are compared. The correspondence is particularly striking for genus zero torsion-free congruence subgroups as exemplified by those which ...
متن کاملSpectra of modular random graphs
Abstract We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete. Two different types of inter-module connectivities are considered, one where the number of intermodule connections per-node diverges, and one where th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1976
ISSN: 0022-314X
DOI: 10.1016/0022-314x(76)90097-4